Search results for "Packet switching"
showing 10 items of 11 documents
A Novel Fault-Tolerant Routing Algorithm for Mesh-of-Tree Based Network-on-Chips
2019
Use of bus architecture based communication with increasing processing elements in System-on-Chip (SoC) leads to severe degradation of performance and speed of the system. This bottleneck is overcome with the introduction of Network-on-Chips (NoCs). NoCs assist in communication between cores on a single chip using router based packet switching technique. Due to miniaturization, NoCs like every Integrated circuit is prone to different kinds of faults which can be transient, intermittent or permanent. A fault in any one component of such a crucial network can degrade performance leaving other components non-usable. This paper presents a novel Fault-Tolerant routing Algorithm for Mesh-of-Tree …
Channel Switching Protocols Hinder the Transition to IP World: The Pentagon Story
2019
In this paper, we target the strategy for telecommunications architectures during the transition to the IP-only models. The paper discusses the shifting from circuit switching to packet switching in telecommunications. Particularly, we analyze the coexistence of circuit switching and packet switching technologies in American military communications where each warfare object should have own IP address. The paper discusses the role of multifunction Soft Switches (MFSS). This Soft Switch plays the role of a media gateway between TDM channels and IP channels. As a case, we are passing through the transformation from SS7 signaling to internet protocol, ISDN-based government Defense Red Switch Ne…
Channel-dependent load balancing in wireless packet networks
2004
This paper refers to a wireless cellular packet network scenario where fast retransmission of corrupted packets is used to improve the packet error ratio. Since the ‘gross’ packet transmission rate (including retransmission) depends on the channel quality perceived, admitted calls weight unevenly in terms of effective resource consumption. In this paper, we suggest using channel quality information to drive load balancing mechanisms. We propose two novel metrics to determine the best cell to attach to, during handover or new call origination. Extensive simulation results prove the superiority of our proposed schemes with respect to traditional load balancing, which base their operation on t…
Out-of-Band Signaling Scheme for High Speed Wireless LANs
2007
In recent years, the physical layer data rate provided by 802.11 Wireless LANs has dramatically increased thanks to significant advances in the modulation and coding techniques employed. However, previous studies show that the 802.11 MAC operation, namely the distributed coordination function (DCF), represents a limiting factor: the throughput efficiency drops as the channel bit rate increases, and a throughput upper limit does indeed exist when the channel bit rate goes to infinite high. These findings indicate that the performance of the DCF protocol will not be efficiently improved by merely increasing the channel bit rate. This paper shows that the DCF performance may significantly bene…
Deadline-based QoS Algorithms for High-performance Networks
2007
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for high-performance networks. In this paper, we explore how to adapt efficiently the earliest deadline first family of algorithms to the high-speed networks environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
Aggregated Packet Transmission in Duty-Cycled WSNs: Modeling and Performance Evaluation
2017
[EN] Duty cycling (DC) is a popular technique for energy conservation in wireless sensor networks (WSNs) that allows nodes to wake up and sleep periodically. Typically, a single-packet transmission (SPT) occurs per cycle, leading to possibly long delay. With aggregated packet transmission (APT), nodes transmit a batch of packets in a single cycle. The potential benefits brought by an APT scheme include shorter delay, higher throughput, and higher energy efficiency. In the literature, different analytical models have been proposed to evaluate the performance of SPT schemes. However, no analytical models for the APT mode on synchronous DC medium access control (MAC) mechanisms exist. In this …
Dynamic packet scheduling performance in UTRA Long Term Evolution downlink
2008
In this paper we evaluate the performance of dynamic Packet Scheduling (PS) of 3GPP UTRAN Long Term Evolution (LTE) Downlink. Packet scheduling is of utmost importance in 3G LTE, because all traffic types with different Quality of Service requirements are competing of the resources. We present a decoupled time and frequency domain packet scheduling framework for LTE downlink. Simulation results with three basic packet scheduler combinations with different amount of fairness are presented in four different 3GPP macro simulation cases to show the both extremes in tradeoff between fairness and spectral efficiency. In addition, the effect of multiuser diversity on packet scheduling performance …
User bandwidth usage-driven HNN neuron excitation method for maximum resource utilization within packet-switched communication networks
2006
Mobile and wireless systems beyond 3G are being designed under the user-centric paradigm. Dynamic resource allocation (DRA) is a topic on intensive research to address efficiently such paradigm. Hopfield neural networks (HNN) have proved useful in the past to solve this kind of complex optimization problems. Recently, various approaches have been proposed to realize HNN-based user-centric DRA. However, the initial algorithms suffer from severe instability problems impacting the overall performance. This letter analyses the source of the existing limitations and proposes an enhanced formulation, ensuring maximum resource utilization while optimizing the convergence of the neural network. The…
Letter Throughput and Delay Analysis of the Ideal Window
1999
We consider the problem of random access communications over a time slotted channel with feedback of infinitely multiplicity at the beginning of each collision resolution interval (CRI), i.e., users know via instantaneous feedback the number of users involved in that collision. Once this is known, the resolution algorithm (CRA) operates with binary (successful / non successful, s/ns) feedback. The analysis of this simple full feedback sensing window random access algorithm, named ideal window stabilized ALOHA, (IWSA), algorithm, provides a throughput of 0.5052 packets/slot, Its delay is also analyzed and compared with similar algorithms.
An analytical model of a new packet marking algorithm for TCP flows: Preliminary insights
2004
In differentiated services networks, packet marking schemes can be devised to differentiate packets belonging to a same TCP flow, with the goal of improving the experienced performance. This paper presents an analytical model for an adaptive packet marking scheme proposed in our previous work. The model combines three specific sub-models aimed at describing i) the TCP sources aggregate ii) the marker, and iii) the network status. Some preliminary simulative results seem to validate the model.